Reconstruction from subsequences

نویسندگان

  • Miroslav Dudík
  • Leonard J. Schulman
چکیده

We consider the problem of reconstructing an n-sequence, given the multiplicities with which k-sequences occur as subsequences. We improve the lower bound on k from Oðlog nÞ to expðOðlog nÞÞ: r 2003 Published by Elsevier Inc.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Sequence Reconstruction Problem

Despite recent advances, assembly of genomes from the high-throughput data generated by the next-generation sequencing (NGS) technologies remains one of the most challenging tasks in modern biology. Here we address the sequence reconstruction problem, whereby, for a given collection of subsequences or factors, one has to determine the set of sequences compliant with the collection. First, we gi...

متن کامل

Sequencing by Hybridization of Long Targets

Sequencing by Hybridization (SBH) reconstructs an n-long target DNA sequence from its biochemically determined l-long subsequences. In the standard approach, the length of a uniformly random sequence that can be unambiguously reconstructed is limited to n = O(2(l)) due to repetitive subsequences causing reconstruction degeneracies. We present a modified sequencing method that overcomes this lim...

متن کامل

Strong Divergence of Reconstruction Procedures for the Paley-Wiener Space $\mathcal{PW}^1_π$ and the Hardy Space $\mathcal{H}^1$

Previous results on certain sampling series have left open if divergence only occurs for certain subsequences or, in fact, in the limit. Here we prove that divergence occurs in the limit. We consider three canonical reconstruction methods for functions in the Paley-Wiener space PW 1 π. For each of these we prove an instance when the reconstruction diverges in the limit. This is a much stronger ...

متن کامل

Reconstruction of matrices from submatrices

For an arbitrary matrix A of n×n symbols, consider its submatrices of size k×k, obtained by deleting n−k rows and n−k columns. Optionally, the deleted rows and columns can be selected symmetrically or independently. We consider the problem of whether these multisets determine matrix A. Following the ideas of Krasikov and Roditty in the reconstruction of sequences from subsequences, we replace t...

متن کامل

Mining Biological Repetitive Sequences Using Support Vector Machines and Fuzzy SVM

Structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. Biggest class of the repetitive subsequences is “Transposable Elements” which has its own sub-classes upon contexts’ structures. Many researches have been performed to criticality determine the structure and function of repetitiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 103  شماره 

صفحات  -

تاریخ انتشار 2003